The Oberwolfach Problem in Graph Theory
نویسنده
چکیده
During the summer of 2007, I participated in a Research Experience for Undergraduates (REU) at Illinois State University. I was one of eight undergraduates, all of whom were mathematics education majors. During my eight week experience, we worked with four in-service teachers from the Normal-Bloomington area, as well as math and math education professors from Illinois State and surrounding universities. We discussed several applications of discrete mathematics and did original research, particularly in graph theory. In this article, I will be discussing the Oberwolfach problem, an open problem in graph theory that I spent most of my time working on throughout the REU.
منابع مشابه
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle components in each 2-factor like the Oberwolfach problem, but such that every admissible cycle size appears at least once in some 2-factor. The solution takes advantage of both Piotrowski’s decomposition techniques used to ...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملOn bipartite 2-factorizations of kn - I and the Oberwolfach problem
It is shown that if F1, F2, . . . , Ft are bipartite 2-regular graphs of order n and α1, α2, . . . , αt are non-negative integers such that α1+α2+· · ·+αt = n−2 2 , α1 ≥ 3 is odd, and αi is even for i = 2, 3, . . . , t, then there exists a 2-factorisation of Kn−I in which there are exactly αi 2-factors isomorphic to Fi for i = 1, 2, . . . , t. This result completes the solution of the Oberwolfa...
متن کاملOn factorisations of complete graphs into circulant graphs and the Oberwolfach Problem
Various results on factorisations of complete graphs into circulant graphs and on 2factorisations of these circulant graphs are proved. As a consequence, a number of new results on the Oberwolfach Problem are obtained. For example, a complete solution to the Oberwolfach Problem is given for every 2-regular graph of order 2p where p ≡ 5 (mod 8) is prime.
متن کاملGraph Products and New Solutions to Oberwolfach Problems
We introduce the circle product, a method to construct simple graphs starting from known ones. The circle product can be applied in many different situations and when applied to regular graphs and to their decompositions, a new regular graph is obtained together with a new decomposition. In this paper we show how it can be used to construct infinitely many new solutions to the Oberwolfach probl...
متن کامل